package trees;

public class UniquePathsWithObstacles {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        System.out.println(m);
        System.out.println(n);
        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(String.valueOf(dp[i][j]) + ' ');
            }
            System.out.println();
        }
        System.out.println("------------");

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(String.valueOf(obstacleGrid[i][j]) + ' ');
            }
            System.out.println();
        }

        System.out.println("------------");

        for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++) {
            dp[0][j] = 1;
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                System.out.print(String.valueOf(dp[i][j]) + ' ');
            }
            System.out.println();
        }

        System.out.println();


        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (obstacleGrid[i][j] == 1) {
                    continue;
                }
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                System.out.print("dp" + i + "-" + j + ":" + dp[i][j] + " ");
            }
        }

        return dp[m - 1][n - 1];
    }

    public static void main(String[] args) {
        UniquePathsWithObstacles obstacles = new UniquePathsWithObstacles();
        int[][] data = {{0, 0, 0}, {0, 1, 0}, {0, 0, 0}};
        System.out.println(obstacles.uniquePathsWithObstacles(data));
    }
}
